Locally connected topologies associated with a given complete metrizable topology
نویسندگان
چکیده
منابع مشابه
Weaker connected and weaker nowhere locally compact topologies for metrizable and similar spaces
We prove that any metrizable non-compact space has a weaker metrizable nowhere locally compact topology. As a consequence, any metrizable non-compact space has a weaker Hausdorff connected topology. The same is established for any Hausdorff space X with a σ -locally finite base whose weight w(X) is a successor cardinal. 2002 Elsevier Science B.V. All rights reserved. AMS classification: Prima...
متن کاملWeak Topologies for the Closed Subsets of a Metrizable Space
The purpose of this article is to propose a unified theory for topologies on the closed subsets of a metrizable space. It can be shown that all of the standard hyperspace topologies—including the Hausdorff metric topology, the Vietoris topology, the Attouch-Wets topology, the Fell topology, the locally finite topology, and the topology of Mosco convergence—arise as weak topologies generated by ...
متن کاملBasic Intervals in the Partial Order of Metrizable Topologies
For a set X, let Σm(X) denote the set of metrizable topologies on X, partially ordered by inclusion. We investigate the nature of intervals in this partial order, with particular emphasis on basic intervals (in other words, intervals in which the topology changes at at most one point). We show that there are no non-trivial finite intervals in Σm(X) (indeed, every such interval contains a copy o...
متن کاملLocally Connected Recursion Categories
A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of non-complemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally pr...
متن کاملLocally Connected Recurrent Networks
The fully connected recurrent network (FRN) using the on-line training method, Real Time Recurrent Learning (RTRL), is computationally expensive. It has a computational complexity of O(N 4) and storage complexity of O(N 3), where N is the number of non-input units. We have devised a locally connected recurrent model which has a much lower complexity in both computational time and storage space....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1961
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1961.100470